A Parallel Shared Memory Implementation of the Fast Multipole Method for Electromagnetics
نویسنده
چکیده
An implementation of the multilevel Fast Multipole method for time harmonic electromagnetic computations is presented. The method is parallelized for shared memory machines. A new parallelization scheme which is a hybrid between previous methods is proposed. Several symmetries and other methods that reduce the storage requirement are proposed. The most important symmetry is for the translation operators. A method for reducing the CPU-time in the interpolation is also proposed.
منابع مشابه
Electromagnetics Computations Using the MPI Parallel Implementation of the Steepest Descent Fast Multipole Method (SDFMM)
The computational solution of large-scale linear systems of equations necessitates the use of fast algorithms but is also greatly enhanced by employing parallelization techniques. The objective of this work is to demonstrate the speedup achieved by the MPI (Message Passing Interface) parallel implementation of the Steepest Descent Fast Multipole Method (SDFMM). Although this algorithm has alrea...
متن کاملPVFMM: A parallel kernel independent FMM for particle and volume potentials
We describe our implementation of a parallel fast multipole method for evaluating potentials for discrete and continuous source distributions. The first requires summation over the source points and the second requiring integration over a continuous source density. Both problems require O(N2) complexity when computed directly; however, can be accelerated toO(N) time using FMM. In our PVFMM soft...
متن کاملParallel multigrid summation for the N-body problem
An Θ(n) parallel multigrid summation method for the N -body problem is presented. The method works with vacuum or periodic boundary conditions. It is based on a hierarchical decomposition of computational kernels on multiple grids. For low accuracy calculations, appropriate for molecular dynamics, a sequential implementation is faster than both Fast Multipole and Particle Mesh Ewald (PME). Its ...
متن کاملCommunication Complexity of the Fast Multipole Method and its Algebraic Variants
A combination of hierarchical tree-like data structures and data access patterns from fast multipole methods and hierarchical low-rank approximation of linear operators from H-matrix methods appears to form an algorithmic path forward for efficient implementation of many linear algebraic operations of scientific computing at the exascale. The combination provides asymptotically optimal computat...
متن کاملHierarchical Parallelization of MLFMA for the Efficient Solution of Large-Scale Electromagnetics Problems
We present the details of a hierarchical partitioning strategy for the efficient parallelization of the multilevel fast multipole algorithm (MLFMA) on distributedmemory architectures. Unlike previous parallelization approaches, this strategy is based on the simultaneous distribution of clusters and their fields by considering the optimal partitioning of each level separately. Using the hierarch...
متن کامل